A curved exponential family model for complex networks
نویسندگان
چکیده
منابع مشابه
Curved exponential family models for social networks
Curved exponential family models are a useful generalization of exponential random graph models (ERGMs). In particular, models involving the alternating k-star, alternating k-triangle, and alternating k-twopath statistics of Snijders et al (2006) may be viewed as curved exponential family models. This article unifies recent material in the literature regarding curved exponential family models f...
متن کاملInference in Curved Exponential Family Models for Networks
Network data arise in a wide variety of applications. Although descriptive statistics for networks abound in the literature, the science of fitting statistical models to complex network data is still in its infancy. The models considered in this article are based on exponential families; therefore, we refer to them as exponential random graph models (ERGMs). Although ERGMs are easy to postulate...
متن کاملHairs for the Complex Exponential Family
In this paper we consider both the dynamical and parameter planes for the complex exponential family Eλ(z) = λez where the parameter λ is complex. We show that there are infinitely many curves or “hairs” in the dynamical plane that contain points whose orbits underEλ tend to infinity and hence are in the Julia set. We also show that there are similar hairs in the λ-plane. In this case, the hair...
متن کاملExponential-family random graph models for valued networks.
Exponential-family random graph models (ERGMs) provide a principled and flexible way to model and simulate features common in social networks, such as propensities for homophily, mutuality, and friend-of-a-friend triad closure, through choice of model terms (sufficient statistics). However, those ERGMs modeling the more complex features have, to date, been limited to binary data: presence or ab...
متن کاملLearning Hidden Curved Exponential Family Models to Infer Face-to-Face Interaction Networks from Situated Speech Data
In this paper, we present a novel probabilistic framework for recovering global, latent social network structure from local, noisy observations. We extend curved exponential random graph models to include two types of variables: hidden variables that capture the structure of the network and observational variables that capture the behavior between actors in the network. We develop a novel combi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational and Mathematical Organization Theory
سال: 2008
ISSN: 1381-298X,1572-9346
DOI: 10.1007/s10588-008-9055-x